Padded polynomials, their cousins, and geometric complexity theory
نویسندگان
چکیده
We establish basic facts about the varieties of homogeneous polynomials divisible by powers of linear forms, and explain consequences for geometric complexity theory. This includes quadratic set-theoretic equations, a description of the ideal in terms of the kernel of a linear map that generalizes the Foulkes-Howe map, and an explicit description of the coordinate ring of the normalization. We also prove asymptotic injectivity of the Foulkes-Howe map.
منابع مشابه
Geometric complexity theory and matrix powering
Valiant’s famous determinant versus permanent problem is the flagship problem in algebraic complexity theory. Mulmuley and Sohoni (Siam J Comput 2001, 2008) introduced geometric complexity theory, an approach to study this and related problems via algebraic geometry and representation theory. Their approach works by multiplying the permanent polynomial with a high power of a linear form (a proc...
متن کاملPartial Derivatives in Arithmetic Complexity and Beyond
How complex is a given multivariate polynomial? The main point of this survey is that one can learn a great deal about the structure and complexity of polynomials by studying (some of) their partial derivatives. The bulk of the survey shows that partial derivatives provide essential ingredients in proving both upper and lower bounds for computing polynomials by a variety of natural arithmetic m...
متن کاملApproximate Compaction and Padded-Sorting on Exclusive Write PRAMs
Padded-sorting is a task of placing input items in an array in a nondecreasing order, but with free space between consecutive elements allowed. For many applications, paddedsorting is as useful as sorting. Approximate compaction and compression are closely related problems. It is known that time complexity of padded-sorting on randomized CRCW PRAMs is considerably lower than time complexity of ...
متن کاملA Wronskian Approach to the real \tau-conjecture
According to the real τ -conjecture, the number of real roots of a sum of products of sparse univariate polynomials should be polynomially bounded in the size of such an expression. It is known that this conjecture implies a superpolynomial lower bound on the arithmetic circuit complexity of the permanent. In this paper, we use the Wronksian determinant to give an upper bound on the number of r...
متن کاملBoundaries of VP and VNP
One fundamental question in the context of the geometric complexity theory approach to the VP vs. VNP conjecture is whether VP = VP, where VP is the class of families of polynomials that can be computed by arithmetic circuits of polynomial degree and size, and VP is the class of families of polynomials that can be approximated infinitesimally closely by arithmetic circuits of polynomial degree ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1204.4693 شماره
صفحات -
تاریخ انتشار 2012